Characteristic polynomials of symmetric matrices over the univariate polynomial ring
نویسندگان
چکیده
منابع مشابه
Characteristic polynomials of real symmetric random matrices
It is shown that the correlation functions of the random variables det(λ−X), in which X is a real symmetric N × N random matrix, exhibit universal local statistics in the large N limit. The derivation relies on an exact dual representation of the problem: the k-point functions are expressed in terms of finite integrals over (quaternionic) k × k matrices. However the control of the Dyson limit, ...
متن کاملSmall-Span Characteristic Polynomials of Integer Symmetric Matrices
Let f(x) ∈ Z[x] be a totally real polynomial with roots α1 ≤ . . . ≤ αd. The span of f(x) is defined to be αd − α1. Monic irreducible f(x) of span less than 4 are special. In this paper we give a complete classification of those small-span polynomials which arise as characteristic polynomials of integer symmetric matrices. As one application, we find some low-degree polynomials that do not aris...
متن کاملConstruction of Lightweight MDS Matrices over Matrix Polynomial Residue Ring
In this article, we investigate the construction of lightweight MDS matrices over the matrix polynomial residue ring. According to distributions of the minimum polynomial, distributions of XOR count and equivalence classes of MDS matrices, we propose an algorithm, which not only can construct lightest MDS matrices, but also is evidently more efficient than previous methods. Moreover, we investi...
متن کاملCharacteristic Polynomials of p-adic Matrices
We analyze the precision of the characteristic polynomial χ(A) of an n × n p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p), we give a criterion (checkable in time O (̃n)) for χ(A) to have precision exactly O(p). We also give a O (̃n) algorithm for determining the optimal precision when the criterion is not satisfied, and give examp...
متن کاملCharacteristic Polynomials of Nonnegative Integral Square Matrices and Clique Polynomials
Clique polynomials of vertex-weighted simple graphs coincide with polynomials of the form det(1 − xM), M a square matrix over N.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2017
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2017.05.036